Search

This paper introduces an algorithmic approach to the analysis of bifurcation of limit cycles from the centers of nonlinear continuous differential systems via the averaging method. We develop three algorithms to implement the averaging method. The first algorithm allows one to transform the considered differential systems to the normal form of averaging. Here, we restricted the unperturbed term of the normal form of averaging to be identically zero. The second algorithm is used to derive the computational formulae of the averaged functions at any order. The third algorithm is based on the first two algorithms and determines the exact expressions of the averaged functions for the considered differential systems. The proposed approach is implemented in Maple and its effectiveness is shown by several examples. Moreover, we report some incorrect results in published papers on the averaging method.

The main goal of this article is to connect some recent perspectives in the study of 4 4 -manifolds from the vantage point of singularity theory. We present explicit algorithms for simplifying the topology of various maps on 4 4 -manifolds, which include broken Lefschetz fibrations and indefinite Morse 2 2 -functions. The algorithms consist of sequences of moves, which modify indefinite fibrations in smooth 1 1 -parameter families. These algorithms allow us to give purely topological and constructive proofs of the existence of simplified broken Lefschetz fibrations and Morse 2 2 -functions on general 4 4 -manifolds, and a theorem of Auroux–Donaldson–Katzarkov on the existence of certain broken Lefschetz pencils on near-symplectic 4 4 -manifolds. We moreover establish a correspondence between broken Lefschetz fibrations and Gay–Kirby trisections of 4 4 -manifolds, and show the existence and stable uniqueness of simplified trisections on all 4 4 -manifolds. Building on this correspondence, we also provide several new constructions of trisections, including infinite families of genus- 3 3 trisections with homotopy inequivalent total spaces, and exotic same genera trisections of 4 4 -manifolds in the homeomorphism classes of complex rational surfaces.

Based on the control strategies, transmission mechanism and clinical progression of COVID-19, we propose a compartmental model with time delays. Two time delays are introduced into the model to describe the incubation period of the disease and the quarantine period of uninfected individuals who have contacts with infected people. In order to reveal the spread rule for COVID-19, we study the threshold dynamics for the model. The basic reproduction number \begin{document}$ \mathcal R_0 $\end{document} is obtained. When \begin{document}$ \mathcal R_0 , the disease-free equilibrium is locally asymptotically stable, when \begin{document}$ \mathcal R_0>1 $\end{document} , the disease-free equilibrium is unstable and the disease is uniformly persistent. As the model's applications, we study COVID-19 transmission in the United States. The parameters are chosen to fit public data in the US. The numerical results indicate that an outbreak peak time in the US will appear in the middle of March. Sensitive analysis results show that enhancing the control measures, such as keeping social distance, wearing masks, isolation etc., can significantly contribute to the prevention and control of COVID-19 infection.

In 1943, Hadwiger conjectured that every graph with no K t + 1 minor is t-colorable for every t ≥ 0 . While Hadwiger's conjecture does not hold for list-coloring, the linear weakening is conjectured to be true. In the 1980 s, Kostochka and Thomason independently proved that every graph with no K t minor has average degree O ( t log ⁡ t ) and thus is O ( t log ⁡ t ) -list-colorable. Recently, the authors and Song proved that every graph with no K t minor is O ( t ( log ⁡ t ) β ) -colorable for every β > 1 4 . Here, we build on that result to show that every graph with no K t minor is O ( t ( log ⁡ t ) β ) -list-colorable for every β > 1 4 . Our main new tool is an upper bound on the number of vertices in highly connected K t -minor-free graphs: We prove that for every β > 1 4 , every Ω ( t ( log ⁡ t ) β ) -connected graph with no K t minor has O ( t ( log ⁡ t ) 7 / 4 ) vertices.

In this paper, we study the null controllability of a nonlinear age, space and two-sex structured population dynamics model. This model is such that the nonlinearity and the couplage are at birth level. We consider a population with males and females and we are dealing with two cases of null controllability problems. The first problem is related to the total extinction, which means that, we estimate a time \begin{document}$ T $\end{document} to bring the male and female subpopulation density to zero. The second case concerns null controllability of male or female subpopulation. Since the absence of males or females in the population stops births; so, if we have the total extinction of the females at time \begin{document}$ T, $\end{document} and if \begin{document}$ A $\end{document} is the life span of the individuals, at time \begin{document}$ T+A $\end{document} one will get certainly the total extinction of the population. Our method uses first an observability inequality related to the adjoint of an auxiliary system, a null controllability of the linear auxiliary system, and after the Schauder's fixed point theorem.

In this paper, we propose an efficient numerical method for a comprehensive infection model that is formulated by a system of nonlinear coupling advection-diffusion-reaction equations. Using some subtle mixed explicit-implicit treatments, we construct a linearized and decoupled discrete scheme. Moreover, the proposed scheme is capable of preserving the positivity of variables, which is an essential requirement of the model under consideration. The proposed scheme uses the cell-centered finite difference method for the spatial discretization, and thus, it is easy to implement. The diffusion terms are treated implicitly to improve the robustness of the scheme. A semi-implicit upwind approach is proposed to discretize the advection terms, and a distinctive feature of the resulting scheme is to preserve the positivity of variables without any restriction on the spatial mesh size and time step size. We rigorously prove the unique existence of discrete solutions and positivity-preserving property of the proposed scheme without requirements for the mesh size and time step size. It is worthwhile to note that these properties are proved using the discrete variational principles rather than the conventional approaches of matrix analysis. Numerical results are also provided to assess the performance of the proposed scheme.

The number of proper vertex-3-colorings of every triangle-free planar graph with n vertices and with no separating cycle of length 4 or 5 is at least 2 n / 17700000 . On the other hand, for infinitely many n, there exists a triangle-free planar graph with separating cycles of length 4 and 5 whose number of proper vertex-3-colorings is 2 15 n / log 2 ⁡ ( n ) .

Objectives. To examine the disease-specific excess deaths during the COVID-19 pandemic in the United States. Methods. We used weekly death data from the National Center for Health Statistics to analyze the trajectories of excess deaths from specific diseases in the United States during the COVID-19 pandemic, at the national level and in 4 states, from the first to 52nd week of 2020. We used the average weekly number of deaths in the previous 6 years (2014–2019) as baseline. Results. Compared with the same week at baseline, the trajectory of number of excess deaths from cardiovascular disease (CVD) was highly parallel to the trajectory of the number of excess deaths related to COVID-19. The number of excess deaths from diabetes mellitus, influenza and respiratory diseases, and malignant neoplasms remained relatively stable over time. Conclusions. The parallel trajectory of excess mortality from CVD and COVID-19 over time reflects the fact that essential health services for noncommunicable diseases were reduced or disrupted during the COVID-19 pandemic, and the severer the pandemic, the heavier the impact.

We prove that pseudorandom sets in the Grassmann graph have near-perfect expansion. This completes the last missing piece of the proof of the 2-to-2-Games Conjecture (albeit with imperfect completeness). The Grassmann graph has induced subgraphs that are themselves isomorphic to Grassmann graphs of lower orders. A set of vertices is called pseudorandom if its density within all such subgraphs (of constant order) is at most slightly higher than its density in the entire graph. We prove that pseudorandom sets have almost no edges within them. Namely, their edge-expansion is very close to 1.

Objectives. To estimate excess all-cause mortality in Philadelphia, Pennsylvania, during the COVID-19 pandemic and understand the distribution of excess mortality in the population. Methods. With a Poisson model trained on recent historical data from the Pennsylvania vital registration system, we estimated expected weekly mortality in 2020. We compared these estimates with observed mortality to estimate excess mortality. We further examined the distribution of excess mortality by age, sex, and race/ethnicity. Results. There were an estimated 3550 excess deaths between March 22, 2020, and January 2, 2021, a 32% increase above expectations. Only 77% of excess deaths (n = 2725) were attributed to COVID-19 on the death certificate. Excess mortality was disproportionately high among older adults and people of color. Sex differences varied by race/ethnicity. Conclusions. Excess deaths during the pandemic were not fully explained by COVID-19 mortality; official counts significantly undercount the true death toll. Far from being a great equalizer, the COVID-19 pandemic has exacerbated preexisting disparities in mortality by race/ethnicity. Public Health Implications. Mortality data must be disaggregated by age, sex, and race/ethnicity to accurately understand disparities among groups.

We show that a A-linear map of Hilbert A-modules is induced by a unitary Hilbert module operator if and only if it extends to an ordinary unitary on appropriately defined enveloping Hilbert spaces. Applications to the theory of multiplicative unitaries let us to compute the equivalence classes of Hilbert modules over a class of C*-algebraic quantum groups. We, thus, develop a theory that, for example, could be used to show non-existence of certain co-actions. In particular, we show that the Cuntz semigroup functor takes a co-action to a multiplicative action.

The aim of this paper is to study, by using the mathematical tools developed by Chałupnik, Touzé, and Van der Kallen, the effect of the Frobenius twist on $\operatorname{Ext}$-group in the category of strict polynomial functors. As an application, we obtain explicit formulas of cohomology of the orthogonal groups and symplectic ones.

In this paper, we investigate temporal clusters of extremes defined as subsequent exceedances of high thresholds in a stationary time series. Two meaningful features of these clusters are the probability distribution of the cluster size and the ordinal patterns giving the relative positions of the data points within a cluster. Since these patterns take only the ordinal structure of consecutive data points into account, the method is robust under monotone transformations and measurement errors. We verify the existence of the corresponding limit distributions in the framework of regularly varying time series, develop non-parametric estimators and show their asymptotic normality under appropriate mixing conditions. The performance of the estimators is demonstrated in a simulated example and a real data application to discharge data of the river Rhine., Deutsche Forschungsgemeinschaft, Projekt DEAL

Let $\mathcal{M}$ be a $\sigma$-finite von Neumann algebra, equipped with a normal faithful state $\varphi$, and let $\mathcal{A}$ be maximal subdiagonal algebra of $\mathcal{M}$. We prove Stein-Weiss type interpolation theorem of Haagerup noncommutative $H^{p}$-spaces associated with $\A$., Comment: 16. arXiv admin note: text overlap with arXiv:2209.08542

This paper puts forward a new account of rigorous mathematical proof and its epistemology. One novel feature is a focus on how the skill of reading and writing valid proofs is learnt, as a way of understanding what validity itself amounts to. The account is used to address two current questions in the literature: that of how mathematicians are so good at resolving disputes about validity, and that of whether rigorous proofs are necessarily formalizable.

Since Kripke, philosophers have distinguished a priori true statements from necessarily true ones. A statement is a priori true if its truth can be established before experience, and necessarily true if it could not have been false according to logical or metaphysical laws. This distinction can be captured formally using two-dimensional semantics.There is a natural way to extend the notions of apriority and necessity so they can also apply to questions. Questions either can or cannot be resolved before experience, and either are or are not about necessary facts. Classical two-dimensionalism has no account of question meanings, so it has to be combined with a framework for question semantics in order to capture these observations. It is shown in [14] how two-dimensional semantics can be combined with inquisitive semantics, in which questions are analyzed in terms of information. The present paper investigates the logic of two-dimensional inquisitive semantics, and provides a complete proof system.

The entropy power inequality (EPI) and the Brascamp-Lieb inequality (BLI) are fundamental inequalities concerning the differential entropies of linear transformations of random vectors. The EPI provides lower bounds for the differential entropy of linear transformations of random vectors with independent components. The BLI, on the other hand, provides upper bounds on the differential entropy of a random vector in terms of the differential entropies of some of its linear transformations. In this paper, we define a family of entropy functionals, which we show are subadditive. We then establish that Gaussians are extremal for these functionals by mimicking the idea in Geng and Nair (2014). As a consequence, we obtain a new entropy inequality that generalizes both the BLI and EPI. By considering a variety of independence relations among the components of the random vectors appearing in these functionals, we also obtain families of inequalities that lie between the EPI and the BLI., Comment: 38 pages, 1 figure. Submitted to the IEEE Transactions on Information Theory for possible publication

We study the list decodability of different ensembles of codes over the real alphabet under the assumption of an omniscient adversary. It is a well-known result that when the source and the adversary have power constraints $ P $ and $ N $ respectively, the list decoding capacity is equal to $ \frac{1}{2}\log\frac{P}{N} $. Random spherical codes achieve constant list sizes, and the goal of the present paper is to obtain a better understanding of the smallest achievable list size as a function of the gap to capacity. We show a reduction from arbitrary codes to spherical codes, and derive a lower bound on the list size of typical random spherical codes. We also give an upper bound on the list size achievable using nested Construction-A lattices and infinite Construction-A lattices. We then define and study a class of infinite constellations that generalize Construction-A lattices and prove upper and lower bounds for the same. Other goodness properties such as packing goodness and AWGN goodness of infinite constellations are proved along the way. Finally, we consider random lattices sampled from the Haar distribution and show that if a certain number-theoretic conjecture is true, then the list size grows as a polynomial function of the gap-to-capacity., Comment: Significantly revised

To characterize the progression of structural and functional changes in the retinas of a small cohort of unrelated patients with early late-onset retinal degeneration and evaluate these changes as potential biomarkers for future treatment trials.Best-corrected visual acuity, contrast sensitivity, Goldman visual fields, retinal sensitivity measurement by mesopic microperimetry, extent of ellipsoid zone disruption using spectral domain optical coherence tomography, and fundus autofluorescence imaging were performed at each biennial visit.Three unrelated patients with molecularly confirmed late-onset retinal degeneration (S163R mutation in C1QTNF5 ) were prospectively followed for 4 years.The patient's ages were 44, 54, and 62 at baseline. Over the 4-year follow-up period, one patient demonstrated a significant reduction in best-corrected visual acuity (6 Early Treatment of Diabetic Retinopathy Study letters), whereas two patients suffered a significant reduction in contrast sensitivity. Early in the disease, there was a close relationship between ellipsoid zone disruption and a loss in retinal sensitivity. Later in the course of the disease, there were areas outside the zones of ellipsoid zone disruption that also suffered progressive loss of retinal sensitivity, suggesting that ellipsoid zone loss was not the only factor responsible for the loss of retinal sensitivity. Changes in fundus autofluorescence and Goldman visual field loss were not closely related to changes in ellipsoid zone disruption or retinal sensitivity loss.This study has found that the monitoring of the progression of ellipsoid zone disruption and changes in mesopic microperimetry may be useful biomarkers in future clinical trials in patients with late-onset retinal degeneration.

In this paper, we initiate the study of the weighted paging problem with predictions. This continues the recent line of work in online algorithms with predictions, particularly that of Lykouris and Vassilvitski (ICML 2018) and Rohatgi (SODA 2020) on unweighted paging with predictions. We show that unlike unweighted paging, neither a fixed lookahead nor knowledge of the next request for every page is sufficient information for an algorithm to overcome existing lower bounds in weighted paging. However, a combination of the two, which we call the strong per request prediction (SPRP) model, suffices to give a 2-competitive algorithm. We also explore the question of gracefully degrading algorithms with increasing prediction error, and give both upper and lower bounds for a set of natural measures of prediction error., Comment: 27 pages

We determine the 2-fusion systems of J-component type in which the centralizer of some fully centralized involution has a maximal J-component that is the 2-fusion system of U 3 ( 3 ) .

The submonoid of the 3-strand braid group B 3 generated by σ 1 and σ 1 σ 2 is known to yield an exotic Garside structure on B 3 . We introduce and study an infinite family ( M n ) n ≥ 1 of Garside monoids generalizing this exotic Garside structure, i.e., such that M 2 is isomorphic to the above monoid. The corresponding Garside group G ( M n ) is isomorphic to the ( n , n + 1 ) -torus knot group–which is isomorphic to B 3 for n = 2 and to the braid group of the exceptional complex reflection group G 12 for n = 3 . This yields a new Garside structure on ( n , n + 1 ) -torus knot groups, which already admit several distinct Garside structures. The ( n , n + 1 ) -torus knot group is an extension of B n + 1 , and the Garside monoid M n surjects onto the submonoid Σ n of B n + 1 generated by σ 1 , σ 1 σ 2 , … , σ 1 σ 2 ⋯ σ n , which is not a Garside monoid when n > 2 . Using a new presentation of B n + 1 that is similar to the presentation of G ( M n ) , we nevertheless check that Σ n is an Ore monoid with group of fractions isomorphic to B n + 1 , and give a conjectural presentation of it, similar to the defining presentation of M n . This partially answers a question of Dehornoy–Digne–Godelle–Krammer–Michel.

We introduce an algorithmic framework to investigate spherical and geodesic growth series of braid groups relatively to the Artin's or Birman–Ko–Lee's generators. We present our experimentations in the case of three and four strands and conjecture rational expressions for the spherical growth series with respect to the Birman–Ko–Lee's generators.

We study the trace set of the commutator subgroup of Gamma(2), a type of Local-Global problem about thin groups. We determine the local obstructions and then use the correspondence between binary quadratic forms and hyperbolic matrices to find some global obstructions. We then develop a probabilistic argument for the existence of sufficiently large admissible traces by modeling the elements as non-backtracking random walks in a 2-dimensional lattice via their homology class and word length. Finally, we investigate the number of commutators needed to represent matrices in the commutator subgroup. This is done using an algorithm of Goldstein and Turner along with utilizing properties of level k-Markoff type surfaces. We conjecture that any trace in the commutator subgroup of $Gamma(2)$ can be represented with either 1 or 2 commutators.

This paper introduces two fundamental types of ordinal sum constructions for partially ordered monoids that are determined by two specific partial orderings on the disjoint union of the partially ordered monoids. Both ordinal sums of partially ordered monoids are generalized with the help of operators on posets, which combine, in some sense, the properties of interior and closure operators on posets. The proposed approach provides a unified view on several known constructions of ordinal sums of t-norms and t-conorms on posets (lattices) and introduces generalized ordinal sums of uninorms on posets (lattices).

We study a quotient of the group algebra of the braid group in which the Artin generators satisfy a cubic relation. This quotient is maximal among the ones satisfying such a cubic relation. We also investigate the proper quotients of it that appear in the realm of quantum groups, and describe another maximal quotient related to the usual Hecke algebras. Finally, we describe the connection between this algebra and a quotient of the algebra of horizontal chord diagrams introduced by Vogel. We prove that these two are isomorphic for n ≤ 5 .

This paper proves the conjectures (previously proved in the case n = 0 ) that for any Coxeter system ( W , S ) and any natural number n, the set of n-small roots for W is bipodal and the set of n-low elements of W is a Garside shadow. The proof here uses special cases ( k = 3 ) of properties (notably, their existence) of certain maximal rank k reflection subgroups of W, for non-negative integers k.

We consider Artin-Tits groups of FC type and prove the two following results. If any two distinct elements of a standard parabolic subgroup are conjugated by a standard generator of the whole group, then this generator has to be in the subgroup. We also prove that classical transversals of standard parabolic subgroups of Artin-Tits groups of FC type are compatible with intersection with standard parabolic subgroups: If A X , A Y are two standard parabolic subgroups of an Artin-Tits groups A of FC type and T is the classical transversal of A X in A, then T ∩ A Y is a transversal of A X ∩ Y in A Y . So the two properties hold for Artin-Tits groups of spherical type and Right-angled Artin-Tits groups.

In this paper, we study the Cartesian product of signed graphs as defined by Germina, Hameed and Zaslavsky (2011). Here we focus on its algebraic properties and look at the chromatic number of some Cartesian products. One of our main results is the unicity of the prime factor decomposition of signed graphs. This leads us to present an algorithm to compute this decomposition in linear time based on a decomposition algorithm for oriented graphs by Imrich and Peterin (2018). We also study the chromatic number of a signed graph, that is the minimum order of a signed graph to which the input signed graph admits a homomorphism, of graphs with underlying graph of the form P n □ P m , of Cartesian products of signed paths, of Cartesian products of signed complete graphs and of Cartesian products of signed cycles.

Motivated in part by representation theoretic questions, we prove that if G is a finite quasi-simple group, then there exists an elementary abelian subgroup of G that contains a member of each conjugacy class of involutions of G.

Let $G$ be a finite group of order divisible by a prime $p$. The number of $p$-regular and $p'$-regular conjugacy classes of $G$ is at least $2\sqrt{p-1}$. Also, the number of $p$-rational and $p'$-rational irreducible characters of $G$ is at least $2\sqrt{p-1}$. Along the way we prove a uniform lower bound for the number of $p$-regular classes in a finite simple group of Lie type in terms of its rank and size of the underlying field., 46 pages

Several combinatorial actions of the affine Weyl group of type C ˜ n on triangulations, trees, words and permutations are compared. Addressing a question of David Vogan, we show that, modulo a natural involution, these permutation representations are multiplicity-free. The proof uses a general construction of Gelfand subgroups in the affine Weyl groups of types C ˜ n and B ˜ n .

Garside theory emerged from the study of Artin groups and their generalizations. Finite-type Artin groups admit two types of interval Garside structures corresponding to their standard and dual presentations. Concerning affine Artin groups, Digne established interval Garside structures for two families of these groups by using their dual presentations. Recently, McCammond established that none of the remaining dual presentations (except for one additional case) correspond to interval Garside structures. In this paper, shifting attention from dual presentations to other nice presentations for the affine Artin group of type A ˜ discovered by Shi and Corran–Lee–Lee, I will construct interval Garside structures related to this group. This construction is the first successful attempt to establish interval Garside structures not related to the dual presentations in the case of affine Artin groups.

By work of Belyĭ [2] , the absolute Galois group G Q = Gal ( Q ‾ / Q ) of the field Q of rational numbers can be embedded into A = Aut ( F ˆ 2 ) , the automorphism group of the free profinite group F ˆ 2 on two generators. The image of G Q lies inside G T ˆ , the Grothendieck-Teichmuller group. While it is known that every abelian representation of G Q can be extended to G T ˆ , Lochak and Schneps [13] put forward the challenge of constructing irreducible non-abelian representations of G T ˆ . We do this virtually, namely by showing that a rich class of arithmetically defined representations of G Q can be extended to finite index subgroups of G T ˆ . This is achieved, in fact, by extending these representations all the way to finite index subgroups of A = Aut ( F ˆ 2 ) . We do this by developing a profinite version of the work of Grunewald and Lubotzky [7] , which provided a rich collection of representations for the discrete group Aut ( F d ) .

An even Artin group is a group which has a presentation with relations of the form ( s t ) n = ( t s ) n with n ≥ 1 . With a group G we associate a Lie Z -algebra TG r ( G ) . This is the usual Lie algebra defined from the lower central series, truncated at the third rank. For each even Artin group G we determine a presentation for TG r ( G ) . By means of this presentation we obtain information about the diagram of G. We then prove an isomorphism criterion for Coxeter matrices that ensures that the diagram of G is uniquely determined by this information. Let d ≥ 2 . We show that, if two even Artin groups G and H having presentations with relations of the form ( s t ) d k = ( t s ) d k with k ≥ 0 are such that TG r ( G ) ≃ TG r ( H ) , then G and H have the same presentation up to permutation of the generators. On the other hand, we show an example of two non-isomorphic even Artin groups G and H such that TG r ( G ) ≃ TG r ( H ) .

In this paper we introduce and study some geometric objects associated to Artin monoids. The Deligne complex for an Artin group is a cube complex that was introduced by the second author and Davis (1995) to study the K(\pi,1) conjecture for these groups. Using a notion of Artin monoid cosets, we construct a version of the Deligne complex for Artin monoids. We show that for any Artin monoid this cube complex is contractible. Furthermore, we study the embedding of the monoid Deligne complex into the Deligne complex for the corresponding Artin group. We show that for any Artin group this is a locally isometric embedding. In the case of FC-type Artin groups this result can be strengthened to a globally isometric embedding, and it follows that the monoid Deligne complex is CAT(0) and its image in the Deligne complex is convex. We also consider the Cayley graph of an Artin group, and investigate properties of the subgraph spanned by elements of the Artin monoid. Our final results show that for a finite type Artin group, the monoid Cayley graph embeds isometrically, but not quasi-convexly, into the group Cayley graph., Comment: 21 pages

Starting from an integrable rank-$n$ vertex model, we construct an explicit family of partition functions indexed by compositions $\mu = (\mu_1,\dots,\mu_n)$. Using the Yang-Baxter algebra of the model and a certain rotation operation that acts on our partition functions, we show that they are eigenfunctions of the Cherednik-Dunkl operators $Y_i$ for all $1 \leq i \leq n$, and are thus equal to nonsymmetric Macdonald polynomials $E_{\mu}$. Our partition functions have the combinatorial interpretation of ensembles of coloured lattice paths which traverse a cylinder. Applying a simple bijection to such path ensembles, we show how to recover the well-known combinatorial formula for $E_{\mu}$ due to Haglund-Haiman-Loehr., Comment: 36 pages

As a promising technology in the development of human healthcare services, the wireless body area networks (WBANs) technology has attracted widespread attention in recent years from both industry and academia. However, due to the sensitiveness of the medical system and the capability limitation of the wearable devices, security, privacy, and efficiency of the healthcare services in WBANs are remained as major challenges. Although different authentication mechanisms have been designed to meet the challenges in recent years, most of them suffer from some functional defects or security problems. In this paper, we firstly provide a review and cryptanalysis on the state-of-theart authentication scheme. In order to meet the challenges and address the drawbacks in previous works, we then propose a new efficient and anonymous authentication scheme for cloud based WBANs. Through the security analysis, we show that our scheme could overcome the weaknesses in previous schemes and meet all the security requirements. Besides, we show the advantages of the proposed scheme through performance evaluation in terms of functionality features, computation overhead, communication overhead and storage overhead, which shows our scheme is more appropriate for practical applications on healthcare services.

We show that, on the Riemann hypothesis, $\limsup_{X\to\infty}I(X)/X^{2} \leq 0.8603$, where $I(X) = \int_X^{2X} (\psi(x)-x)^2\,dx.$ This proves (and improves on) a claim by Pintz from 1982. We also show unconditionally that $\frac{1}{5\,374}\leq I(X)/X^2 $ for sufficiently large $X$, and that the $I(X)/X^{2}$ has no limit as $X\rightarrow\infty$., Comment: 23 pages

There is widespread excitement in the literature about the method of arbitrary functions: many take it to show that it is from the dynamics of systems that the objectivity of probabilities emerge. In this paper, I differentiate three ways in which a probability function might be objective, and I argue that the method of arbitrary functions cannot help us show that dynamics objectivise probabilities in any of these senses.

A family $\mathcal{F}$ of elliptic curves defined over number fields is said to be typically bounded in torsion if the torsion subgroups $E(F)[$tors$]$ of those elliptic curves $E_{/F}\in \mathcal{F}$ can be made uniformly bounded after removing from $\mathcal{F}$ those whose number field degrees lie in a subset of $\mathbb{Z}^+$ with arbitrarily small upper density. For every number field $F$, we prove unconditionally that the family $\mathcal{E}_F$ of elliptic curves defined over number fields and with $F$-rational $j$-invariant is typically bounded in torsion. For any integer $d\in\mathbb{Z}^+$, we also strengthen a result on typically bounding torsion for the family $\mathcal{E}_d$ of elliptic curves defined over number fields and with degree $d$ $j$-invariant., 17 pages, to appear in Journal of Number Theory

Purpose The authors describe a case of new bilateral epiretinal membranes and vitreous cells following intravitreal and subTenon's injections of bone marrow-derived stem cells. Methods Case report of a 43-year-old man with OPA-1 autosomal dominant optic atrophy who self-enrolled in a stem cell therapy clinical trial and received simultaneous bilateral intravitreal and subTenon's injections of bone marrow-derived stem cells. Results Within one month of receiving the injections, the patient developed epiretinal membranes and vitreous cells in both eyes, seen with optical coherence tomography. Conclusion Stem cell therapy has been gaining popularity as a potential intervention for progressive retinal and optic nerve diseases; however, the mechanism of action of bone marrow-derived stem cells is still not well understood and may result in unintended cell differentiation.

To present immunocytochemical characterization of a surgically excised central posterior lens capsule (PLC) that was transplanted to close a secondary refractory full-thickness macular hole (FTMH) as an epiretinal flap. For comparison, tissue of both an unaffected internal limiting membrane and unexposed PLC was processed.Clinical-pathological case report.We report of a 38-year-old patient who underwent pars plana vitrectomy (PPV) with PLC tissue for patching secondary FTMH and silicone oil tamponade after tractional retinal detachment. The PLC was peeled off during a vitrectomy 1 year after positioning. For immunocytochemistry, the removed PLC was prepared as flat mount and showed a positive immunofluorescence of the Müller cells marker glutamine synthetase and for vimentin. The microglia marker IBA and the neuroprotective neurotrophic marker glia cell-derived neurotrophic factor were tested positive too. There was no immunoreactivity of cellular retinaldehyde-binding protein and glial fibrillary acidic protein. In comparison, tissue of a control internal limiting membrane that was obtained during standard FTMH surgery showed few single cells that were likewise positive for glutamine synthetase, glia cell-derived neurotrophic factor, and IBA. The control specimen of unexposed PLC showed rarely cells that were without positive immunostaining for the tested markers.Our analysis revealed positive immunoreactivity of macroglia and microglia cells of the PLC tissue that was used to patch a refractory FTMH. Similar immunostaining of PLC material and internal limiting membrane suggests the PLC transplantation as an alternative treatment option for refractory FTMH.

Recently, a symmetric differential operator (SDO) is attracted to studying in the field of mathematical analysis. A new formal of SDO is presented to generalize some well known differential operators in a complex domain. According to this formulation, we shall exam the boundedness and compactness of this operator in complex spaces, such as Hilbert space and Sobolev space. For this purpose, we suggest new norms to solve the fractional Beltrami equation in the open unit disk. This operator has ability to depict the analytic geometric representation of the solution of second order differential equation utilizing the concept of Schwarzian derivative in the open unit disk. Applications in imagings are given the sequel.

A graph database is a digraph whose arcs are labeled with symbols from a fixed alphabet. A regular graph pattern (RGP) is a digraph whose edges are labeled with regular expressions over the alphabet. RGPs model navigational queries for graph databases called conjunctive regular path queries (CRPQs). A match of a CRPQ in the database is witnessed by a special navigational homomorphism of the corresponding RGP to the database. We study the complexity of deciding the existence of a homomorphism between two RGPs. Such homomorphisms model a strong type of containment between the two corresponding CRPQs. We show that this problem can be solved by an EXPTIME algorithm (while general query containmement in this context is EXPSPACE-complete). We also study the problem for restricted RGPs over a unary alphabet, that arise from some applications like XPath or SPARQL. For this case, homomorphism-based CRPQ containment is in NP. We prove that certain interesting cases are in fact polynomial-time solvable., 15 pages. Short version appeared in the proceedings of the 15th Conference on Computability in Europe (CIE 2019)

Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of such curves admitting representatives that intersect at most k times. We prove that the automorphism group of the k-curve graph of a surface S is isomorphic to the extended mapping class group for all k sufficiently small with respect to the Euler characteristic of S. We prove the same result for the so-called systolic complex, a variant of the curve graph whose complete subgraphs encode the intersection patterns for any collection of systoles with respect to a hyperbolic metric. This resolves a conjecture of Schmutz Schaller., Comment: 33 pages, 23 figures, 1 table. Incorporated referee comments. To appear in the Michigan Mathematical Journal

Objectives. To assess SARS-CoV-2 transmission within a correctional facility and recommend mitigation strategies. Methods. From April 29 to May 15, 2020, we established the point prevalence of COVID-19 among incarcerated persons and staff within a correctional facility in Arkansas. Participants provided respiratory specimens for SARS-CoV-2 testing and completed questionnaires on symptoms and factors associated with transmission. Results. Of 1647 incarcerated persons and 128 staff tested, 30.5% of incarcerated persons (range by housing unit = 0.0%–58.2%) and 2.3% of staff tested positive for SARS-CoV-2. Among those who tested positive and responded to symptom questions (431 incarcerated persons, 3 staff), 81.2% and 33.3% were asymptomatic, respectively. Most incarcerated persons (58.0%) reported wearing cloth face coverings 8 hours or less per day, and 63.3% reported close contact with someone other than their bunkmate. Conclusions. If testing remained limited to symptomatic individuals, fewer cases would have been detected or detection would have been delayed, allowing transmission to continue. Rapid implementation of mass testing and strict enforcement of infection prevention and control measures may be needed to mitigate spread of SARS-CoV-2 in this setting.

In this paper, we study approximation properties of single hidden layer neural networks with weights varying on finitely many directions and thresholds from an open interval. We obtain a necessary and at the same time sufficient measure theoretic condition for density of such networks in the space of continuous functions. Further, we prove a density result for neural networks with a specifically constructed activation function and a fixed number of neurons., 12 pages

There are two definitions of Einstein-Finsler spaces introduced by Akbar-Zadeh, which we will show is equal along the integral curves of $I$-invariant projective vector fields. The sub-algebra of the $C$-projective vector fields, leaving the $H$-curvature invariant, has been studied extensively. Here we show on a closed Finsler space with negative definite Ricci curvature reduces to that of Killing vector fields. Moreover, if an Einstein-Finsler space admits such a projective vector field then the flag curvature is constant. Finally, a classification of compact isotropic mean Landsberg manifolds admitting certain projective vector fields is obtained with respect to the sign of Ricci curvature., 25 pages